On the integrality ratio of the subtour LP for Euclidean TSP
نویسنده
چکیده
A long standing conjecture says that the integrality ratio of the subtour LP for metric TSP is 4/3. A well known family of graphic TSP instances achieves this lower bound asymptotically. For Euclidean TSP the best known lower bound on the integrality ratio was 8/7. We improve this value by presenting a family of Euclidean TSP instances for which the integrality ratio of the subtour LP converges to 4/3. keywords: traveling salesman problem; subtour LP; Held-Karp bound; integrality ratio; Euclidean TSP
منابع مشابه
On the Integrality Gap of the Subtour LP for the 1, 2-TSP
In this paper, we study the integrality gap of the subtour LP relaxation for the traveling salesman problem in the special case when all edge costs are either 1 or 2. For the general case of symmetric costs that obey triangle inequality, a famous conjecture is that the integrality gap is 4/3. Little progress towards resolving this conjecture has been made in thirty years. We conjecture that whe...
متن کاملAn Improved Integrality Gap for Asymmetric TSP Paths
The Asymmetric Traveling Salesperson Path (ATSPP) problem is one where, given an asymmetric metric space (V, d) with specified vertices s and t, the goal is to find an s-t path of minimum length that visits all the vertices in V . This problem is closely related to the Asymmetric TSP (ATSP) problem, which seeks to find a tour (instead of an s-t path) visiting all the nodes: for ATSP, a ρ-approx...
متن کاملThe Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio
We give a new, strongly polynomial algorithm and improved analysis of the metric s − t path TSP. The algorithm finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap. A key new idea is the deletion of some edges, where the arising connectivity problems can be solved for a minor extra cost. ...
متن کاملTSP Tours in Cubic Graphs: Beyond 4/3
After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a Hamiltonian tour of length at most (4/3)n, establishing in particular that the integrality gap of the subtour LP is at most 4/3 for cubic 2-connected graphs and matching the conjectured value of the famous 4/3 conjectu...
متن کاملAngewandte Mathematik Und Informatik Universit at Zu K Oln on Approximately Fair Cost Allocation in Euclidean Tsp Games on Approximately Fair Cost Allocation in Euclidean Tsp Games
We consider the problem of allocating the cost of an optimal traveling salesman tour in a fair way among the nodes visited; in particular, we focus on the case where the distance matrix of the underlying TSP problem satisses the triangle inequality. We thereby use the model of TSP games in the sense of cooperative game theory. We give examples showing that the core of such games may be empty, e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 42 شماره
صفحات -
تاریخ انتشار 2014